Q-convergence with interquartile ranges

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stratified $(L,M)$-fuzzy Q-convergence spaces

This paper presents the concepts of $(L,M)$-fuzzy Q-convergence spaces and stratified $(L,M)$-fuzzy Q-convergence spaces. It is shown that the category of stratified $(L,M)$-fuzzy Q-convergence spaces is a bireflective subcategory of the category of $(L,M)$-fuzzy Q-convergence spaces, and the former is a Cartesian-closed topological category. Also, it is proved that the category of stratified $...

متن کامل

Cubic surfaces and q-numerical ranges

Let A be an n × n complex matrix and 0 ≤ q ≤ 1. The boundary of the q-numerical range of A is the orthogonal projection of a hypersurface defined by the dual surface of the homogeneous polynomial F (t, x, y, z) = det(t In + x(A + A )/2 + y(A−A)/(2i) + z AA). We construct different types of cubic surfaces SF corresponding to the homogeneous polynomial F (t, x, y, z) induced by some 3 × 3 matrice...

متن کامل

Further study on $L$-fuzzy Q-convergence structures

In this paper, we discuss the equivalent conditions of pretopological and topological $L$-fuzzy Q-convergence structures and define $T_{0},~T_{1},~T_{2}$-separation axioms in $L$-fuzzy Q-convergence space. {Furthermore, $L$-ordered Q-convergence structure is introduced and its relation with $L$-fuzzy Q-convergence structure is studied in a categorical sense}.

متن کامل

ON THE ALMOSTLY SURE CONVERGENCE OF THE SEQUENCE D_P,Q

In this paper, we will discuss the concept of almost sure convergence for specic groups of fuzzyrandom variables. For this purpose, we use the type of generalized Chebyshev inequalities.Moreover, we show the concept of almost sure convergence of weighted average pairwise NQDof fuzzy random variables.

متن کامل

Fastest Convergence for Q-learning

The Zap Q-learning algorithm introduced in this paper is an improvement of Watkins’ original algorithm and recent competitors in several respects. It is a matrix-gain algorithm designed so that its asymptotic variance is optimal. Moreover, an ODE analysis suggests that the transient behavior is a close match to a deterministic Newton-Raphson implementation. This is made possible by a two time-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Dynamics and Control

سال: 2005

ISSN: 0165-1889

DOI: 10.1016/j.jedc.2004.10.004